Typed-feature based phrase structure grammars in Trale
نویسنده
چکیده
signature type hierarchy bot type feature1 :value1 feature2 :value2 subtype1 subtype2. theory.pl string-> preterminal. rulename rule mother ===> cat> daughter1 cat> daughter2. (trale/0) signature type_hierarchy bot s np vp .
منابع مشابه
Implementing HPSG grammars Part II: The TRALE system
The signature declares the basic set of type and feature names for use in descriptions. These names must start with a lower case letter and continue with a-z, type_hierarchy bot sign phrase dtr:list word cat:cat cat noun verb list ne_list hd:bot tl:list e_list .
متن کاملFormalization and Parsing of Typed Unification-Based ID/LP Grammars
This paper de nes uni cation based ID/LP grammars based on typed feature structures as nonterminals and proposes a variant of Earley's algorithm to decide whether a given input sentence is a member of the language generated by a particular typed uni cation ID/LP grammar. A solution to the problem of the nonlocal ow of information in uni cation ID/LP grammars as mentioned in Sei ert (1991) is in...
متن کاملKorean Phrase Structure Grammar and Its Implementations into the LKB System
Though there exist various morphological analysers developed for Korean, no serious attempts have been made to build its syntactic or semantic parser(s), partly because of its structural complexity and partly because of the existence of no reliable grammar-build up system. This paper presents a result of our on-going project to build up a computationally feasible Korean Phrase Structure Grammar...
متن کاملAn Algebra for Semantic Construction in Constraint-based Grammars
We develop a framework for formalizing semantic construction within grammars expressed in typed feature structure logics, including HPSG. The approach provides an alternative to the lambda calculus; it maintains much of the desirable flexibility of unificationbased approaches to composition, while constraining the allowable operations in order to capture basic generalizations and improve mainta...
متن کاملTerm Encoding of Typed Feature Structures
I explore in this paper a variety of approaches to Prolog term encoding typed feature structure grammars. As in Carpenter [3], the signature for such grammars consists of a bounded complete partial order of types under subsumption (⊒) along with a partial function Approp:Type×Feat ⇀ Type. The appropriateness specification is subject to the constraint that feature-value specifications for subtyp...
متن کامل